Subsampled turbulence removal network

نویسندگان

چکیده

We present a deep-learning approach to restore sequence of turbulence-distorted video frames from turbulent deformations and space-time varying blurs. Instead requiring massive training sample size in deep networks, we purpose strategy that is based on new data augmentation method model turbulence relatively small dataset. Then introduce subsampled enhance the restoration performance presented GAN model. The contributions paper threefold: first, simple but effective algorithm real life for network; Second, firstly Wasserstein combined with $\ell_1$ cost successful turbulence-corrupted sequence; Third, combine subsampling filter out strongly corrupted generate better quality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Double-Star Detection Using Convolutional Neural Network in Atmospheric Turbulence

In this paper, we investigate the usage of machine learning in the detection and recognition of double stars. To do this, numerous images including one star and double stars are simulated. Then, 100 terms of Zernike expansion with random coefficients are considered as aberrations to impose on the aforementioned images. Also, a telescope with a specific aperture is simulated. In this work, two k...

متن کامل

Distortion-driven Turbulence Effect Removal using Variational Model

It remains a challenge to simultaneously remove geometric distortion and space-time-varying blur in frames captured through a turbulent atmospheric medium. To solve, or at least reduce these effects, we propose a new scheme to recover a latent image from observed frames by integrating a new variational model and distortion-driven spatialtemporal kernel regression. The proposed scheme first cons...

متن کامل

A subsampled double bootstrap for massive data

The bootstrap is a popular and powerful method for assessing precision of estimators and inferential methods. However, for massive datasets which are increasingly prevalent, the bootstrap becomes prohibitively costly in computation and its feasibility is questionable even with modern parallel computing platforms. Recently Kleiner, Talwalkar, Sarkar, and Jordan (2014) proposed a method called BL...

متن کامل

Subsampled Hessian Newton Methods for Supervised Learning

Newton methods can be applied in many supervised learning approaches. However, for large-scale data, the use of the whole Hessian matrix can be time-consuming. Recently, subsampled Newton methods have been proposed to reduce the computational time by using only a subset of data for calculating an approximation of the Hessian matrix. Unfortunately, we find that in some situations, the running sp...

متن کامل

Subsampled online matrix factorization with convergence guarantees

We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains more than 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low complexity per iteration and reasonable memory footprint. In contrast to previous online matrix factorization methods, our approach relies on low-dimensional stat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics, computation and geometry of data

سال: 2021

ISSN: ['2642-1917', '2642-1909']

DOI: https://doi.org/10.4310/mcgd.2021.v1.n1.a1